EXPTIME-completeness of thorough refinement on modal transition systems
نویسندگان
چکیده
Article history: Received 4 July 2011 Available online 20 August 2012
منابع مشابه
Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
Modal transition systems (MTS), a specification formalism introduced more than 20years ago, has recently received a considerable attention in several different areas.Many of the fundamental questions related to MTSs have already been answered.However, the problem of the exact computational complexity of thorough refine-ment checking between two finite MTSs remained unsolved....
متن کاملOn Refinements of Boolean and Parametric Modal Transition Systems
We consider the extensions of modal transition systems (MTS), namely Boolean MTS and parametric MTS and we investigate the refinement problems over both classes. Firstly, we reduce the problem of modal refinement over both classes to a problem solvable by a QBF solver and provide experimental results showing our technique scales well. Secondly, we extend the algorithm for thorough refinement of...
متن کاملEXPTIME-complete Decision Problems for Modal and Mixed Specifications
Modal and mixed transition systems are formalisms that allow mixing of overand under-approximation in a single specification. We show EXPTIME-completeness of three fundamental decision problems for such specifications: whether a set of modal or mixed specifications has a common implementation, whether a sole mixed specification has an implementation, and whether all implementations of one mixed...
متن کاملModal transition systems with weight intervals
We propose weighted modal transition systems, an extension to the well-studied specification formalism of modal transition systems that allows to express both required and optional behaviours of their intended implementations. In our extension we decorate each transition with a weight interval that indicates the range of concrete weight values available to the potential implementations. In this...
متن کاملOn Modal Refinement and Consistency
Almost 20 years after the original conception, we revisit several fundamental questions about modal transition systems. First, we demonstrate the incompleteness of the standard modal refinement using a counterexample due to Hüttel. Deciding any refinement, complete with respect to the standard notions of implementation, is shown to be computationally hard (co-NP hard). Second, we consider four ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 218 شماره
صفحات -
تاریخ انتشار 2012